Shortest Path Distance in Manhattan Poisson Line Cox Process
نویسندگان
چکیده
منابع مشابه
Coverage Analysis of a Vehicular Network Modeled as Cox Process Driven by Poisson Line Process
In this paper, we consider a vehicular network in which the wireless nodes are located on a system of roads. We model the roadways, which are predominantly straight and randomly oriented, by a Poisson line process (PLP) and the locations of nodes on each road as a homogeneous 1D Poisson point process (PPP). Assuming that each node transmits independently, the locations of transmitting and recei...
متن کاملApproximating the shortest path in line arrangements
Suppose one has a line arrangement and one wants to find a shortest path from one point lying on a line of the arrangement to another such point. The best known time bound for computing this is O(n2). We develop an algorithm that finds a 1 + approximation of the shortest path in time O(n logn+ (minfn; 1 2 g)1 log 1 ).
متن کاملShortest path distance in random k-nearest neighbor graphs
Consider a weighted or unweighted k-nearest neighbor graph that has been built on n data points drawn randomly according to some density p on R. We study the convergence of the shortest path distance in such graphs as the sample size tends to infinity. We prove that for unweighted kNN graphs, this distance converges to an unpleasant distance function on the underlying space whose properties are...
متن کاملQuerying Shortest Path Distance with Bounded Errors in Large Graphs
Shortest paths and shortest path distances are important primary queries for users to query in a large graph. In this paper, we propose a new approach to answer shortest path and shortest path distance queries efficiently with an error bound. The error bound is controlled by a user-specified parameter, and the online query efficiency is achieved with prepossessing offline. In the offline prepro...
متن کاملALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 2020
ISSN: 0022-4715,1572-9613
DOI: 10.1007/s10955-020-02657-2